Partially Persistent Data Structures of Bounded Degree with Constant Update Time
نویسندگان
چکیده
منابع مشابه
Partially Persistent Data Structures of Bounded Degree with Constant Update Time
The problem of making bounded in-degree and out-degree data structures partially persistent is considered. The node copying method of Driscoll et al. is extended so that updates can be performed in worst-case constant time on the pointer machine model. Previously it was only known to be possible in amortised constant time [2]. The result is presented in terms of a new strategy for Dietz and Ram...
متن کاملOn Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant time algorithm ? Motivated by results and questions of Nguyen and Onak, and of Parnas, Ron and Trevisan, we show that the best approximation ratio that can be achieved for the first question (independence number) is b...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملAutomatic Structures of Bounded Degree Revisited
It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). Presenting an automatic structure of bounded degree whose theory is hard for 2EXPSPACE, we also prove this result to be optimal. These findings close the gap left open in [14].
متن کاملDifferences between Resource Bounded Degree Structures
We exhibit a structural difference between the truth-table degrees of the sets which are truth-table above 0 and the PTIME-Turing degrees of all sets. Though the structures do not have the same isomorphism type, demonstrating this fact relies on developing their common theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1994
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v1i35.21608